Locating Critical Points in 3D Vector Fields using Graphics Hardware
نویسنده
چکیده
Calculating critical points in 3D vector fields is computationally expensive, and requires parameter adjustments to maximize the number and type of critical points found in a particular 3D vector field. This paper details the modifications required to execute Greene’s bisection method directly on graphics hardware, and compares the performance of the CPU+GPU versions to the CPU only versions.
منابع مشابه
Harmonicity and Minimality of Vector Fields on Lorentzian Lie Groups
We consider four-dimensional lie groups equipped with left-invariant Lorentzian Einstein metrics, and determine the harmonicity properties of vector fields on these spaces. In some cases, all these vector fields are critical points for the energy functional restricted to vector fields. We also classify vector fields defining harmonic maps, and calculate explicitly the energy of t...
متن کاملHardware-Accelerated Visualization of Time-Varying 2D and 3D Vector Fields by Texture Advection via Programmable Per-Pixel Operations
We present hardware-accelerated texture advection techniques to visualize the motion of particles in steady or time-varying vector fields given on Cartesian grids. We propose an implementation of 2D texture advection which exploits advanced and programmable texture fetch and per-pixel blending operations on an nVidia GeForce 3. For 3D vector field visualization, we present an algorithm for SGI’...
متن کاملInvestigating the Effects of Hardware Parameters on Power Consumptions in SPMV Algorithms on Graphics Processing Units (GPUs)
Although Sparse matrix-vector multiplication (SPMVs) algorithms are simple, they include important parts of Linear Algebra algorithms in Mathematics and Physics areas. As these algorithms can be run in parallel, Graphics Processing Units (GPUs) has been considered as one of the best candidates to run these algorithms. In the recent years, power consumption has been considered as one of the metr...
متن کاملFast visualization of complex 3D models using displacement mapping
We present a simple method to render complex 3D models at interactive rates using real-time displacement mapping. We use an octree to decompose the 3D model into a set of height fields and display the model by rendering the height fields using per-pixel displacement mapping. By simply rendering the faces of the octree voxels to produce fragments for ray-casting on the GPU, and with straightforw...
متن کاملMonodromy problem for the degenerate critical points
For the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. When the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. In this paper we will consider the polynomial planar vector fields ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009